Synchronization of Pushdown Automata
نویسنده
چکیده
We introduce the synchronization of a pushdown automaton by a sequential transducer associating an integer to each input word. The visibly pushdown automata are the automata synchronized by an one state transducer whose output labels are −1, 0, 1. For each transducer, we can decide whether a pushdown automaton is synchronized. The pushdown automata synchronized by a given transducer accept languages which form an effective boolean algebra containing the regular languages and included in the deterministic real-time context-free languages.
منابع مشابه
Synchronization of Grammars
Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizing previous sub-classes such as visibly and height-deterministic pushdown automata. The languages recognized by grammars synchronized by a given grammar form an effective boolean algebra lying between regular languages and dete...
متن کاملSynchronized Finite Automata and 2DFA Reductions
Ibarra, O.H. and N.Q. Trgn, Synchronized finite automata and 2DFA reductions, Theoretical Computer Science 115 (1993) 261-275. We establish a tight hierarchy of two-way synchronized finite automata with only universal states on the number of allowed processes (Y(ZSUFA(k-proc)) c Y(ZSUFA((k+ 1)-proc))) by studying the reduction functions made by two-way deterministic finite automata with a one-w...
متن کاملOn Quantum Pushdown Automata
Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of quantum pushdown automata in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitarity criteria of quantum pushdown automata are not equiv...
متن کاملReducing Deep Pushdown Automata
This contribution presents reducing variant of the deep pushdown automata. Deep pushdown automata is a new generalization of the classical pushdown automata. Basic idea of the modification consists of allowing these automata to access more deeper parts of pushdown and reducing strings to non-input symbols in the pushdown. It works similarly to bottom-up analysis simulation of context-free gramm...
متن کاملOn the Complexity of Bisimulation Problems for Pushdown Automata
All bisimulation problems for pushdown automata are at least PSPACE-hard. In particular, we show that (1) Weak bisimilarity of pushdown automata and nite automata is PSPACE-hard, even for a small xed nite automaton, (2) Strong bisimilarity of pushdown au-tomata and nite automata is PSPACE-hard, but polynomial for every xed nite automaton, (3) Regularity ((niteness) of pushdown automata w.r.t. w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006